" Undergraduate Electromagnetics : Discrete , Numeric , and Continuous
نویسنده
چکیده
This paper describes a new approach to undergraduate electromagnetics that is based on spatial discretization and numeric computation. The initial coverage is limited to quasi-static, twodimensional, Cartesian geometries with no leakage flux, descriptive of many ideal lumped circuit elements with which the students are already familiar. The circuit behavior of resistors, capacitors, and inductors motivates the introduction, formulation and interpretation of the behavior of the electric and magnetic fields. The fields within the elements are expressed by Laplace’s equation in discretized form. This formulation provides the basis for numeric computations that exploit the power of modern PCs. In addition, PC-based software provides a rich graphic environment that enables students to display the solutions in a variety of visual modes. The simplicity of this approach allows students to focus upon the electromagnetic principles and to gain valuable experience in solving problems. In the simplest form, classroom and homework activities include spreadsheets, matrix solvers, and circuit analog simulations. More ambitious student activities are realized with a powerful, PC-based, interactive, electromagnetic computation engine that empowers students to experiment with the geometry and material properties of two-dimensional electromagnetic problems. As the students gain experience, the more traditional formulations of continuous differential and integral vector calculus are introduced to complete their preparation for advanced courses. This technologically intensive approach is particularly attractive since all of our students have laptops and most classrooms allow network access to all students. A variety of software packages (including Maple, Mathcad, Matlab, Excel, Pspice and VEM) further enhances this approach. Course details and software demonstrations are included in the presentation.
منابع مشابه
Discretizing Continuous Attributes Using Information Theory
Many classification algorithms require that training examples contain only discrete values. In order to use these algorithms when some attributes have continuous numeric values, the numeric attributes must be converted into discrete ones. This paper describes a new way of discretizing numeric values using information theory. The amount of information each interval gives to the target attribute ...
متن کاملContinuous Discrete Variable Optimization of Structures Using Approximation Methods
Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملDiscrete Hilbert Transform. Numeric Algorithms
The Hilbert and Fourier transforms are tools used for signal analysis in the time/frequency domains. The Hilbert transform is applied to casual continuous signals. The majority of the practical signals are discrete signals and they are limited in time. It appeared therefore the need to create numeric algorithms for the Hilbert transform. Such an algorithm is a numeric operator, named the Discre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002